On restricted matching extension in planar graphs
نویسندگان
چکیده
منابع مشابه
On the restricted matching extension of graphs on the torus and the Klein bottle
Aldred and Plummer proved that every 6-connected even graph minimally embedded on the torus or the Klein bottle is E(1, n)(n ≤ 3) and E(0, n)(n ≤ 5) [R.E.L. Aldred, M.D. Plummer, Restricted matching in graphs of small genus, Discrete Math. 308 (2008) 5907–5921]. In this paper, we can remove the upper bounds on n by showing that every even 6-regular graph G embedded on the torus or the Klein bot...
متن کاملDrawing HV-Restricted Planar Graphs
A strict orthogonal drawing of a graph G = (V,E) in R is a drawing of G such that each vertex is mapped to a distinct point and each edge is mapped to a horizontal or vertical line segment. A graph G is HV -restricted if each of its edges is assigned a horizontal or vertical orientation. A strict orthogonal drawing of an HV -restricted graph G is good if it is planar and respects the edge orien...
متن کاملList precoloring extension in planar graphs
A celebrated result of Thomassen states that not only can every planar graph be colored properly with five colors, but no matter how arbitrary palettes of five colors are assigned to vertices, one can choose a color from the corresponding palette for each vertex so that the resulting coloring is proper. This result is referred to as 5-choosability of planar graphs. Albertson asked whether Thoma...
متن کامل0 On the restricted matching of graphs in surfaces ∗
A connected graph G with at least 2m + 2n + 2 vertices is said to have property E(m,n) if, for any two disjoint matchings M and N of size m and n respectively, G has a perfect matching F such that M ⊆ F and N ∩ F = ∅. In particular, a graph with E(m, 0) is m-extendable. Let μ(Σ) be the smallest integer k such that no graphs embedded on a surface Σ are k-extendable. Aldred and Plummer have prove...
متن کاملLargest planar matching in random bipartite graphs
Given a distribution G over labeled bipartite (multi) graphs, G = (W; M; E) where jWj = jMj = n, let L(n) denote the size of the largest planar matching of G (here W and M are posets drawn on the plane as two ordered rows of nodes, an upper and a lower one, and a (w; m) edge is drawn as a straight line between w and m). The main focus of this work is to understand the asymptotic (in n) behavior...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00305-8